TSTP Solution File: SEV393^5 by Duper---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SEV393^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 19:24:53 EDT 2023

% Result   : Theorem 3.68s 3.87s
% Output   : Proof 3.68s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEV393^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : duper %s
% 0.13/0.35  % Computer : n018.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Thu Aug 24 04:12:57 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 3.68/3.87  SZS status Theorem for theBenchmark.p
% 3.68/3.87  SZS output start Proof for theBenchmark.p
% 3.68/3.87  Clause #0 (by assumption #[]): Eq (Not ((Eq (fun Xz => Or (cR Xz) (cS Xz)) fun Xx => And (cR Xx) (cS Xx)) → ∀ (Xx : Iota), cR Xx → cS Xx)) True
% 3.68/3.87  Clause #1 (by clausification #[0]): Eq ((Eq (fun Xz => Or (cR Xz) (cS Xz)) fun Xx => And (cR Xx) (cS Xx)) → ∀ (Xx : Iota), cR Xx → cS Xx) False
% 3.68/3.87  Clause #2 (by clausification #[1]): Eq (Eq (fun Xz => Or (cR Xz) (cS Xz)) fun Xx => And (cR Xx) (cS Xx)) True
% 3.68/3.87  Clause #3 (by clausification #[1]): Eq (∀ (Xx : Iota), cR Xx → cS Xx) False
% 3.68/3.87  Clause #4 (by clausification #[2]): Eq (fun Xz => Or (cR Xz) (cS Xz)) fun Xx => And (cR Xx) (cS Xx)
% 3.68/3.87  Clause #5 (by argument congruence #[4]): ∀ (a : Iota), Eq ((fun Xz => Or (cR Xz) (cS Xz)) a) ((fun Xx => And (cR Xx) (cS Xx)) a)
% 3.68/3.87  Clause #6 (by clausification #[3]): ∀ (a : Iota), Eq (Not (cR (skS.0 0 a) → cS (skS.0 0 a))) True
% 3.68/3.87  Clause #7 (by clausification #[6]): ∀ (a : Iota), Eq (cR (skS.0 0 a) → cS (skS.0 0 a)) False
% 3.68/3.87  Clause #8 (by clausification #[7]): ∀ (a : Iota), Eq (cR (skS.0 0 a)) True
% 3.68/3.87  Clause #9 (by clausification #[7]): ∀ (a : Iota), Eq (cS (skS.0 0 a)) False
% 3.68/3.87  Clause #10 (by betaEtaReduce #[5]): ∀ (a : Iota), Eq (Or (cR a) (cS a)) (And (cR a) (cS a))
% 3.68/3.87  Clause #12 (by identity boolHoist #[10]): ∀ (a : Iota), Or (Eq (Or (cR a) False) (And (cR a) (cS a))) (Eq (cS a) True)
% 3.68/3.87  Clause #16 (by bool simp #[12]): ∀ (a : Iota), Or (Eq (cR a) (And (cR a) (cS a))) (Eq (cS a) True)
% 3.68/3.87  Clause #18 (by identity boolHoist #[16]): ∀ (a : Iota), Or (Eq (cS a) True) (Or (Eq (cR a) (And (cR a) False)) (Eq (cS a) True))
% 3.68/3.87  Clause #20 (by bool simp #[18]): ∀ (a : Iota), Or (Eq (cS a) True) (Or (Eq (cR a) False) (Eq (cS a) True))
% 3.68/3.87  Clause #21 (by eliminate duplicate literals #[20]): ∀ (a : Iota), Or (Eq (cS a) True) (Eq (cR a) False)
% 3.68/3.87  Clause #22 (by superposition #[21, 8]): ∀ (a : Iota), Or (Eq (cS (skS.0 0 a)) True) (Eq False True)
% 3.68/3.87  Clause #23 (by clausification #[22]): ∀ (a : Iota), Eq (cS (skS.0 0 a)) True
% 3.68/3.87  Clause #24 (by superposition #[23, 9]): Eq True False
% 3.68/3.87  Clause #26 (by clausification #[24]): False
% 3.68/3.87  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------